Wrapper for Building Classification Models Using Covering Arrays

Covering and radius-covering arrays: Constructions and classification

The minimum number of rows in covering arrays (equivalently, surjective codes) and radius-covering arrays (equivalently, surjective codes with a radius) has been determined precisely only in special cases. In this paper, explicit constructions for numerous best known covering arrays (upper bounds) are found by a combination of combinatorial and computational methods. For radius-covering arrays,...

Profiles of covering arrays of strength two

Covering arrays of strength two have been widely studied as combinatorial models of software interaction test suites for pairwise testing. While numerous algorithmic techniques have been developed for the generation of covering arrays with few columns (factors), the construction of covering arrays with many factors and few tests by these techniques is problematic. Random generation techniques c...

New bounds for binary covering arrays using simulated annealing

Covering arrays (CAs) are combinatorial structures specified as a matrix of N rows and k columns over an alphabet on v symbols such that for each set of t columns (called the strength of the array) every t-tuple of symbols is covered. Recently they have been used to represent interaction test suites for software testing given that they provide economical sized test cases while still preserving ...

Using Grid Computing for Constructing Ternary Covering Arrays

Covering arrays from cyclotomy

For a prime power q ≡ 1 (mod v), the q × q cyclotomic matrix, whose entries are the discrete logarithmsmodulo v of the entries in the addition table of Fq , has been shown using character theoretic arguments to produce an ε-biased array, provided that q is large enough as a function of v and ε. A suitable choice of ε ensures that the array is a covering array of strength t when q > t2v4t . On t...